On Asymptotic Probabilities in Logics That Capture DSPACE(log n) in Presence of Ordering
نویسنده
چکیده
We show that for logics that capture DSPACE(log n) over ordered structures, and for recursive probability distributions on the class of nite models of the signature, the 0{1 law and the convergence law hold if and only if certain boundedness conditions are satissed. As one of the applications , we consider the conjecture of Kolaitis and Vardi, stating that for arbitrary probability distributions the 0{1 law holds for the logic L ! ! 1 ! ii the same law holds for xpoint logic.
منابع مشابه
Space-Efficient Deterministic Simulation of Probabilistic Automata
Given a description of a probabilistic automaton (one-head probabilistic nite automaton or probabilistic Turing machine) and an input string x of length n, we ask how much space does a deterministic Turing machine need in order to decide the acceptance of the input string by that automaton? The question is interesting even in the case of one-head one-way probabilistic nite automata (PFA). We ca...
متن کاملAsymptotic Behavior of Weighted Sums of Weakly Negative Dependent Random Variables
Let be a sequence of weakly negative dependent (denoted by, WND) random variables with common distribution function F and let be other sequence of positive random variables independent of and for some and for all . In this paper, we study the asymptotic behavior of the tail probabilities of the maximum, weighted sums, randomly weighted sums and randomly indexed weighted sums of heavy...
متن کاملExact maximum coverage probabilities of confidence intervals with increasing bounds for Poisson distribution mean
A Poisson distribution is well used as a standard model for analyzing count data. So the Poisson distribution parameter estimation is widely applied in practice. Providing accurate confidence intervals for the discrete distribution parameters is very difficult. So far, many asymptotic confidence intervals for the mean of Poisson distribution is provided. It is known that the coverag...
متن کاملAsymptotic Properties of Logics 1
This paper presents the number of results concerning problems of asymptotic densities in the variety of propositional logics. We investigate, for propositional formulas, the proportion of tautologies of the given length n against the number of all formulas of length n. We are specially interested in asymptotic behavior of this fraction. We show what the relation between a number of premises of ...
متن کاملExpressive Power and Complexity of a Logic with Quantifiers that Count Proportions of Sets
We present a second order logic of proportional quantifiers, SOLP, which is essentially a first order language extended with quantifiers that act upon second order variables of a given arity r, and count the fraction of elements in a subset of r–tuples of a model that satisfy a formula. Our logic is capable of expressing proportional versions of different problems of complexity up to NP-hard as...
متن کامل